Extending two families of maximum rank distance codes
نویسندگان
چکیده
In this paper, we properly extend the family of rank-metric codes recently found by Longobardi and Zanella (2021) Longobardi, Marino, Trombetti Zhou (2021). These are F q 2 t -linear dimension in space linearized polynomials over , where is any integer greater than 2, prove that they maximum rank distance codes. For ? 5 determine their equivalence classes these turn out to be inequivalent other construction known so far, hence really new.
منابع مشابه
On the genericity of maximum rank distance and Gabidulin codes
We consider linear rank-metric codes in Fqm . We show that the properties of being MRD (maximum rank distance) and non-Gabidulin are generic over the algebraic closure of the underlying field, which implies that over a large extension field a randomly chosen generator matrix generates an MRD and a non-Gabidulin code with high probability. Moreover, we give upper bounds on the respective probabi...
متن کاملError Performance Analysis of Maximum Rank Distance Codes
In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. We then use elementary linear subspaces to derive properties of maximum rank distance (MRD) codes that parallel those of maximum distance separable (MDS) codes. Using these properties, we show that, for MRD codes with error correction capability t, the deco...
متن کاملSkew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In this work, we introduce a linearized version of such codes, called linearized Reed-Solomon codes. We prove that they have maximum sum-rank distance. Such dist...
متن کاملMaximum distance q -nary codes
t immaru-A q-nary error-correcting code with N = qk code words of length n = k + r can have no greater miniium distance d than r + 1. The class of codes for which d = r + 1 is studied first in general, then with the restriction that the codes be linear. Examples and construction methods are given to show that these codes exist for a number of values of q, k, and r. Proof: Pick any k position. T...
متن کاملSkew codes of prescribed distance or rank
In this paper we propose two methods to produce block codes of prescribed rank or distance. Following [4, 5] we work with skew polynomial rings of automorphism type and the codes we investigate are ideals in quotients of this ring. There is a strong connection with linear difference operators and with linearized polynomials (or q-polynomials) reviewed in the first section. 1 Galois theory of di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2022
ISSN: ['1090-2465', '1071-5797']
DOI: https://doi.org/10.1016/j.ffa.2022.102045